Pandiagonal Sudokus
نویسندگان
چکیده
It is shown that a pandiagonal n2×n2-Sudoku exists if and only if n ≡ ±1 (mod 6). Also for these n the existence of row-cyclic, pandiagonal n2×n2-Sudokus is conjectured and confirmed for n = 5 and n = 7.
منابع مشابه
Lifting Redundancy from Latin Squares to Pandiagonal Latin Squares
In the pandiagonal Latin Square problem, a square grid of size N needs to be filled with N types of objects, so that each column, row, and wrapped around diagonal (both up and down) contains an object of each type. This problem dates back to at least Euler. In its specification as a constraint satisfaction problem, one uses the all different constraint. The known redundancy result about all dif...
متن کاملSudokus and Gröbner Bases: Not Only a Divertimento
Sudoku is a logic-based placement puzzle. We recall how to translate this puzzle into a 9-colouring problem which is equivalent to a (big) algebraic system of polynomial equations. We study how far Gröbner bases techniques can be used to treat these systems produced by Sudokus. This general purpose tool can not be considered as a good solver, but we show that it can be useful to provide informa...
متن کاملPandiagonal Multimagic Squares Based on Large Sets of Orthogonal Arrays
Large sets of orthogonal arrays (LOA) have been used to construct resilient functions and zigzag functions by D. R. Stinson. In this paper, a construction of pandiagonal t-multimagic squares of order n (PMS(n, t)) based on a special kind of LOA called quadruple LOA is presented. As its application, it is shown that there exists a PMS(q, t) for all odd prime power q ≥ 4t− 1 with t ≥ 2, which pro...
متن کاملA Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles
The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n(2) × n(2) grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n(2). Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we prop...
متن کاملFranklin Squares - a Chapter in the Scientic Studies of Magical Squares
Several aspects of magic(al) square studies fall within the computational universe. Experimental computation has revealed patterns, some of which have lead to analytic insights, theorems or combinatorial results. Other numerical experiments have provided statistical results for some very di¢ cult problems. Schindel, Rempel and Loly have recently enumerated the 8th order Franklin squares. While ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012